Computer Science and Artificial Intelligence Laboratory Complexity of Finding Nash Equilibria in 0-1 Bimatrix Games
نویسندگان
چکیده
m a ss a c h u se t t s i n st i t u t e o f t e c h n o l o g y, c a m b ri d g e , m a 02139 u s a — w w w. c s a il. mi t .
منابع مشابه
On the computational complexity of Nash equilibria for (0, 1) bimatrix games
The computational complexity of finding a Nash equilibrium in a nonzero sum bimatrix game is an important open question. We put forward the notion of (0, 1)-bimatrix games, and show that some associated computational problems are as hard as in the general case.
متن کاملEfficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constructing Nash Equilibria (NE in short) in polynomial time, even for bimatrix games, understanding the limitations of the approximability of the problem is of great importance. We initially prove that SuppNE are immune to the addi...
متن کاملAn Empirical Study of Finding Approximate Equilibria in Bimatrix Games
Abstract. While there have been a number of studies about the efficacy of methods to find exact Nash equilibria in bimatrix games, there has been little empirical work on finding approximate Nash equilibria. Here we provide such a study that compares a number of approximation methods and exact methods. In particular, we explore the trade-off between the quality of approximate equilibrium and th...
متن کاملWell Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach
We study the existence and tractability of a notion of approximate equilibria in bimatrix games, called well supported approximate Nash Equilibria (SuppNE in short). We prove existence of ε−SuppNE for any constant ε ∈ (0, 1), with only logarithmic support sizes for both players. Also we propose a polynomial–time construction of SuppNE, both for win lose and for arbitrary (normalized) bimatrix g...
متن کاملZero-Sum Game Techniques for Approximate Nash Equilibria
We apply existing, and develop new, zero-sum game techniques for designing polynomial-time algorithms to compute additive approximate Nash equilibria in bimatrix games. In particular, we give a polynomial-time algorithm that given an arbitrary bimatrix game as an input, outputs either an additive 1 3 -Nash equilibrium or an additive 1 2 -well-supported Nash equilibrium; and we give a polynomial...
متن کامل